Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
571	Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-03-01 11:15:08 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Vertex cover Time complexity Steiner tree problem Theoretical computer science Computational complexity theory Applied mathematics
572	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:22 NP-complete problems Operations research Approximation algorithm Travelling salesman problem APX Steiner tree problem Algorithm Set cover problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
573	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Approximate Matching of Curves to Point Sets Paul Accisano ¨ or Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-20 23:59:44 Complexity classes NP Tangent MAX-3SAT Theoretical computer science Computational complexity theory Geometry
574	LUISA (Library User Interface for Sensitivity Analysis): a generic software component for sensitivity analysis of bio-physical models Add to Reading List Source URL: www.mssanz.org.au Language: English - Date: 2013-01-16 21:40:43 Computational physics Probabilistic complexity theory Statistical mechanics Scientific modeling Process management Sensitivity analysis Morris method Uncertainty analysis Economic model Science Statistics Mathematics
575	Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices Ioannis Koutis1 , Alex Levin2 , and Richard Peng3 1 Computer Science Department, University of Puerto Rico, Río Piedras Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2012-02-13 21:14:04 Analysis of algorithms NP-complete problems Probabilistic complexity theory Randomized algorithm Minor SL Degree Graph partition Time complexity Theoretical computer science Graph theory Computational complexity theory
576	The 118th RCKC Colloquium Search Result Diversification via Filling up Multiple Knapsacks Yu Haitao Add to Reading List Source URL: www.tsukuba.ac.jp Language: English - Date: 2014-12-09 20:27:32 Applied mathematics Combinatorial optimization Cryptography Dynamic programming Knapsack problem Mathematical optimization Optimization problem Recommender system Theoretical computer science Computational complexity theory Operations research
577	A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems Jean-Charles Faugère, Danilo Gligoroski, Ludovic Perret, Simona Samardjiska, Enrico Thomae PKC 2015, March 30 - April 1, Maryland, USA Add to Reading List Source URL: www.iacr.org Language: English - Date: 2015-03-29 21:02:40 Mathematical sciences Polynomial QUAD Time complexity Cryptanalysis Multivariate cryptography Cryptography Applied mathematics Computational complexity theory
578	Space and energy efficient computation with DNA strand displacement systems Chris Thachuk and Anne Condon Department of Computer Science, University of British Columbia, Vancouver, BC, Canada Abstract. Chemical reaction Add to Reading List Source URL: www-devel.cs.ubc.ca Language: English - Date: 2012-06-17 22:22:27 Complexity classes True quantified Boolean formula NL Reversible computing PSPACE-complete PP DSPACE IP Computation Theoretical computer science Computational complexity theory Applied mathematics
579	Boolean Decision Functions Steven Finch April 22, 2015 Let  : {0 1} → {0 1} be the Boolean function that decides whether a given ( + 1)-bit odd integer is square-free. More precisely, ½ Add to Reading List Source URL: www.people.fas.harvard.edu Language: English - Date: 2015-04-21 10:31:24 Integer sequences Algebra Polynomials FO Computational complexity theory Prime number Primality test Square-free integer Irreducible polynomial Mathematics Theoretical computer science Complexity classes
580	There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2010-12-30 12:50:07 Dynamic programming Operations research Complexity classes Approximation algorithms Polynomial-time approximation scheme Knapsack problem Subset sum problem Parameterized complexity Optimization problem Theoretical computer science Computational complexity theory Applied mathematics

UPDATE